package com.atguigu.algorithm;

import java.util.Scanner;

public class NumDivide {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNextInt()){
            StringBuilder sb=new StringBuilder();
            int num=scanner.nextInt();
            int N=num;
            //最快直接建立一个素数表，迅速,厄拉多塞筛法
            boolean[] result=new boolean[num];
            boolean[] flag=new boolean[num+1];
            for(int i=2;i<num;i++){
                if(!flag[i]){
                    result[i]=true;
                }
                for(int j=i;j<num;j+=i){
                    flag[j]=true;
                }
            }
            int[] helper=new int[num];
            for(int i=2;i<N;i++){
                while(num%i==0 && result[i]==true){
                    helper[i]++;
                    num/=i;
                }
            }
            sb.append(N);
            sb.append("=");
            for(int i=2;i<N;i++){
                while(helper[i]!=0){
                    sb.append(i);
                    sb.append("*");
                    helper[i]--;
                }
            }
            sb.delete(sb.length()-1,sb.length());
            System.out.print(sb.toString());
            System.out.print("</br>");
        }
    }
}
